Upper bound on the total number of knot n-mosaics
نویسندگان
چکیده
منابع مشابه
On trees attaining an upper bound on the total domination number
A total dominating set of a graph $G$ is a set $D$ of vertices of $G$ such that every vertex of $G$ has a neighbor in $D$. The total domination number of a graph $G$, denoted by $gamma_t(G)$, is~the minimum cardinality of a total dominating set of $G$. Chellali and Haynes [Total and paired-domination numbers of a tree, AKCE International ournal of Graphs and Combinatorics 1 (2004), 6...
متن کاملon trees attaining an upper bound on the total domination number
a total dominating set of a graph $g$ is a set $d$ of vertices of $g$ such that every vertex of $g$ has a neighbor in $d$. the total domination number of a graph $g$, denoted by $gamma_t(g)$, is~the minimum cardinality of a total dominating set of $g$. chellali and haynes [total and paired-domination numbers of a tree, akce international ournal of graphs and combinatorics 1 (2004), 6...
متن کاملa study on the effectiveness of textual modification on the improvement of iranian upper-intermediate efl learners’ reading comprehension
این پژوهش به منظور بررسی تأثیر اصلاح متنی بر بهبود توانایی درک مطلب زبان آموزان ایرانی بالاتر از سطح میانی انجام پذیرفت .بدین منظور 115 دانشجوی مرد و زن رشته مترجمی زبان انگلیسی در این پزوهش شرکت نمودند.
An upper bound for the total chromatic number
The total chromatic number, Z"(G), of a graph G, is defined to be the minimum number ofcolours needed to colour the vertices and edges of a graph in such a way that no adjacent vertices, no adjacent edges and no incident vertex and edge are given the same colour. This paper shows that )('(G) _< z'(G) + 2x/~G), where z(G)is the vertex chromatic number and )((G)is the edge chromatic number of the...
متن کاملAn Upper Bound for the Turán Number t3(n,4)
Let tr(n, r+ 1) denote the smallest integer m such that every r-uniform hypergraph on n vertices with m+ 1 edges must contain a complete graph on r+ 1 vertices. In this paper, we prove that lim n→∞ t3(n, 4) ( n 3 ) ≤ 3 +17 12 = .593592 . . ..
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Knot Theory and Its Ramifications
سال: 2014
ISSN: 0218-2165,1793-6527
DOI: 10.1142/s0218216514500655